Search results for "Distributive property"

showing 10 items of 12 documents

On monadic quantale algebras: basic properties and representation theorems

2010

Motivated by the concept of quantifier (in the sense of P. Halmos) on different algebraic structures (Boolean algebras, Heyting algebras, MV-algebras, orthomodular lattices, bounded distributive lattices) and the resulting notion of monadic algebra, the paper introduces the concept of a monadic quantale algebra, considers its properties and provides several representation theorems for the new structures.

Algebra and Number TheoryAlgebraic structureApplied MathematicsQuantaleAlgebraMathematics::LogicInterior algebraDistributive propertyComputer Science::Logic in Computer ScienceMathematics::Category TheoryBounded functionLattice (order)QuantaloidMathematicsDiscussiones Mathematicae - General Algebra and Applications
researchProduct

A Proposal for an Automatic Stabilizer in Social Justice

2019

Abstract Generally, social justice has two sides which are intercorrelated and inter-dependend: a) constitutive social justice (for example, the so called commutative social justice); b) regulative social justice (for example, the so called distributive social justice). The paper approaches the regulative social justice, more exactly, an automatic mechanism to get it. To this end, an automatic stabilizer to provide distributive social justice, according to the Rawlsian principle of difference. Such an automatic stabilizer is grounded on the wealth, more precise, on the share of the wealth which is not invested in order to benefit to the more disadvantaged class of the society. Paper does no…

Class (computer programming)Entrepreneurship050208 financeHF5001-6182Social Psychologydistributive social justice05 social sciencesEconomics Econometrics and Finance (miscellaneous)Automatic stabilizerdifference principleDisadvantagedIntervention (law)commutative social justiceDistributive propertyOrder (exchange)0502 economics and businesssocial justiceBusiness Management and Accounting (miscellaneous)automatic stabilizerBusiness050211 marketingSociologyMechanism (sociology)Law and economicsStudies in Business and Economics
researchProduct

On Banaschewski functions in lattices

1991

hold for all x, y ~ X. We call such a function z a Banaschewski function or a B-function on X. A lattice L is a B-lattice or antitonely complemented, if there is a B-function defined on the whole lattice L. For instance, Boolean lattices as well as orthocomplemented lattices are B-lattices. On the other hand, a B-lattice is not necessarily Boolean or orthocomplemented, although a distributive B-lattice is a Boolean lattice. It is shown later that a matroid (geometric) lattice is also a B-lattice. Naturally, our results include the lemma of Banaschewski [ 1, Lemma 4], by which the lattice of the subspaces of a vector space is a B-lattice. It should be emphasized that a B-function is supposed…

CombinatoricsLemma (mathematics)Algebra and Number TheoryDistributive propertyHigh Energy Physics::LatticeLattice (order)Order (group theory)Function (mathematics)Linear subspaceMatroidVector spaceMathematicsAlgebra Universalis
researchProduct

Hyperidentities of some generalizations of lattices

1998

In the paper we present bases and hyperbases of hyperidentities of some generalizations of the variety L of all lattices and the variety D of distributive lattices. We describe the form of hyperidentities of some varieties with two binary operations.

CombinatoricsPure mathematicsAlgebra and Number TheoryDistributive propertyBinary operationHigh Energy Physics::LatticeLattice (order)Distributive latticeMathematicsAlgebra Universalis
researchProduct

Timed Sets, Functional Complexity, and Computability

2012

AbstractThe construction of various categories of “timed sets” is described in which the timing of maps is considered modulo a “complexity order”. The properties of these categories are developed: under appropriate conditions they form discrete, distributive restriction categories with an iteration. They provide a categorical basis for modeling functional complexity classes and allow the development of computability within these settings. Indeed, by considering “program objects” and the functions they compute, one can obtain models of computability – i.e. Turing categories – in which the total maps belong to specific complexity classes. Two examples of this are introduced in some detail whi…

Discrete mathematicscomplexity measurescomputabilityTheoretical computer scienceGeneral Computer ScienceBasis (linear algebra)Restriction categoriesComputabilityModuloTuring categoriesfunctional complexityTheoretical Computer ScienceDistributive propertyMathematics::Category TheoryComplexity classCategorical variableTuringcomputerPMathematicscomputer.programming_languageComputer Science(all)Electronic Notes in Theoretical Computer Science
researchProduct

Justice Perceptions as Predictors of Customer Satisfaction: The Impact of Distributive, Procedural, and Interactional Justice1

2006

This article attempts to extend prior research by testing the effects of justice components (distributive, procedural, and interactional) on customer satisfaction beyond the expectancy disconfirmation paradigm. To this end, two separate field survey studies were conducted. A total of 568 customers were surveyed in 38 hotels and 40 restaurants. The results showed that distributive justice was critical in predicting customer satisfaction, while the influence of procedural and interactional justice was secondary. Justice concepts were also robust against the simultaneous inclusion of disconfirmation and performance in the satisfaction equation. The article concludes with theoretical and manage…

Expectancy theorySocial PsychologyDistributive propertyInteractional justicePerceptionmedia_common.quotation_subjectCustomer satisfactionJustice (ethics)PsychologyDistributive justiceSocial psychologyInclusion (education)media_commonJournal of Applied Social Psychology
researchProduct

Additivity of the Equationally-Defined Commutator and Relatively Congruence-Distributive Subquasivarieties

2015

Pure mathematicsDistributive propertylawAdditive functionSemiprimeCongruence (manifolds)Commutator (electric)Mathematicslaw.invention
researchProduct

Algebraic aspects and coherence conditions for conjunctions among conditional events

2018

We deepen the study of a notion of conjunction among conditional events, introduced in previous papers in theframework of coherence. This notion of conjunction, differently from other approaches, is given in the setting ofconditional random quantities. We show that some well known properties which are satisfied by conjunctionsof unconditional events are also satisfied by conjunctions of conditional events. In particular we examine anadditive property and a decomposition formula, by also obtaining a generalized inclusion-exclusion formula. Then,by exploiting the notion of conjunction, we introduce the set of constituents generated bynconditional events.Moreover, under logical independence, w…

Settore MAT/06 - Probabilita' E Statistica MatematicaCoherenceconditionalevents conditional random quantities conjunction disjunction decomposition formula conditional constituents inclusion-exclusion formula distributive property.
researchProduct

Finitary formal topologies and Stone’s representation theorem

2008

AbstractWe study the concept of finitary formal topology, a point-free version of a topological space with a basis of compact open subsets. The notion of finitary formal topology is defined from the perspective of the Basic Picture (introduced by the second author) and thus it is endowed with a binary positivity relation. As an application, we prove a constructive version of Stone’s representation theorem for distributive lattices. We work within the framework of a minimalist foundation (as proposed by Maria Emilia Maietti and the second author). Both inductive and co-inductive methods are used in most proofs.

Stone's representationGeneral Computer ScienceRelation (database)Representation theoremFormal topologyformal topology; positivity; Stone's representation; constructive methodsPositivityBasis (universal algebra)Topological spaceStone’s representationMathematical proofConstructiveTheoretical Computer ScienceConstructive methodsAlgebraDistributive propertyFinitaryComputer Science(all)MathematicsTheoretical Computer Science
researchProduct

Institutional Arrangements Matter for Both Efficiency and Distribution: Contributions and Challenges of the New Institutional Economics

2011

Are scholars in the New Institutional Economics tradition systematically disregarding distributive aspects when approaching policy issues as was the case during the 1970s and 1980s? Do economic and political agents usually care about distribution too? To provide an answer to these questions is the basic purpose of this chapter. The analysis carried out demonstrates that not all NIE oriented scholars disregard distributive issues. Some contributions are examined as examples, mainly in the so-called political economy branch of NIE. By means of a well-known graphical tool, the chapter also emphasizes that all of us clearly care about distribution, not just about efficiency, when participating …

Transaction costPoliticsPublic economicsDistributive propertybusiness.industryEconomicsDistribution (economics)New institutional economicsPublic choicePositive economicsInstitutional theorybusinessIndifference curve
researchProduct